Chosen Ciphertext k-Trace Attacks on Masked CCA2 Secure Kyber
نویسندگان
چکیده
Single-trace attacks are a considerable threat to implementations of classic public-key schemes, and their implications on newer lattice-based schemes still not well understood. Two recent works have presented successful single-trace targeting the Number Theoretic Transform (NTT), which is at heart many schemes. However, these either require quite powerful side-channel adversary or restricted specific scenarios such as encryption ephemeral secrets. It an open question if can be performed by simpler adversaries while more common scenarios. In this paper, we answer positively. First, present method for crafting ring/module-LWE ciphertexts that result in sparse polynomials input inverse NTT computations, independent used private key. We then demonstrate how sparseness incorporated into attack, thereby significantly improving noise resistance attack compared previous works. The effectiveness our shown use-case CCA2 secure Kyber k-module-LWE, where k ? {2, 3, 4}. Our k-trace long-term secret handle up ? ? 1.2 noisy Hamming weight leakage model, also masked implementations. A 2k-trace variant Kyber1024 even allows 2.2 case, with traces allowing us recover keys 2.7. variants tolerance depending parameter set, ranging from 0.5 0.7. As comparison, similar setting were only 0.5.
منابع مشابه
Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks
Semantic security against chosen-ciphertext attacks (INDCCA) is widely believed as the correct security level for public-key encryption scheme. On the other hand, it is often dangerous to give to only one people the power of decryption. Therefore, threshold cryptosystems aimed at distributing the decryption ability. However, only two efficient such schemes have been proposed so far for achievin...
متن کاملConstructions Secure Against Receiver Selective Opening and Chosen Ciphertext Attacks
In this paper we study public key encryption schemes of indistinguishability security against receiver selective opening (IND-RSO) attacks, where the attacker can corrupt some receivers and get the corresponding secret keys in the multi-party setting. Concretely: – We present a general construction of RSO security against chosen ciphertext attacks (RSO-CCA) by combining any RSO secure scheme ag...
متن کاملImproved Public Key Cryptosystems Secure against Chosen Ciphertext Attacks
This note describes an improvement to the rst two of the three public key cryptosystems proposed by Zheng and Seberry, which are provably secure against chosen ciphertext attacks. The improvement removes a shortcoming with the original cryptosystems, which occurs when they are used for both con dentiality and sender authentication purposes.
متن کاملID-based Encryption Scheme Secure against Chosen Ciphertext Attacks
ID-based encryption allows for a sender to encrypt a message to an identity without access to a public key certificate. Based on the bilinear pairing, Boneh and Franklin proposed the first practical IDbased encryption scheme and used the padding technique of FujisakiOkamto to extend it to be a chosen ciphertext secure version. In this letter, we would like to use another padding technique to pr...
متن کاملEncryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks
Imagine many small devices send data to a single receiver, encrypted using the receiver’s public key. Assume an adversary that has the power to adaptively corrupt a subset of these devices. Given the information obtained from these corruptions, do the ciphertexts from uncorrupted devices remain secure? Recent results suggest that conventional security notions for encryption schemes (like IND-CC...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IACR transactions on cryptographic hardware and embedded systems
سال: 2021
ISSN: ['2569-2925']
DOI: https://doi.org/10.46586/tches.v2021.i4.88-113